منابع مشابه
Practical Solution of the Diophantine Equation
Let p be an odd prime and a, b positive integers. In this note we prove that the problem of the determination of the integer solutions to the equation y2 = x(x + 2apb)(x − 2apb) can be easily reduced to the resolution of the unit equation u+ √ 2v = 1 over Q( √ 2, √ p). The solutions of the latter equation are given by Wildanger’s algorithm.
متن کاملHardware Solution of a First-Order Diophantine Equation
In this paper we present the theoretical framework for enumerating the solutions of the Diophantine equation (1) that helps us define the sets of points, of a nested loop, that can be executed in parallel. The analytical expression for finding those points is given below: + + + = 1 2 ... n i i i c (1) where i1, i2,..., in, ≤ ≤ ∀ = 0 , 1 ... p p i L p n are the loop indices, Lp is the loop bound...
متن کاملA Binomial Diophantine Equation
following result. THEOREM 1. The only (n,m)eZ with n^2 and m5=4 satisfying © = ( 7 ) a r e {n> m)=(2> 4)> (6> 6)> and (21> Our binomial diophantine equation represents an elliptic curve, since it can be rewritten as a quartic polynomial being a square. Indeed, on putting u = 2/i 1 and v = 2m 3, we see at once that Theorem 1 follows from the following result. THEOREM 2. The only (u, v) e Z with ...
متن کاملOn a Diophantine Equation
In this note, we mainly obtain the equation x2m − yn = z2 have finite positive integer solutions (x, y, z,m, n) satisfying x > y be two consecutive primes. Mathematics Subject Classification: 11A41; 11D41
متن کاملAbout a Diophantine Equation
In this paper we study the Diophantine equation x −6xy +5y = 16Fn−1Fn+1, where (Fn) n≥0 is the Fibonacci sequence and we find a class of such equations having solutions which are determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1952
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1952-0045749-8